The Time-distance Radar Plot

Distance Plot ( B ) Size Plot ( C ) Time

Clustering is an important data exploration task. A prominent clustering algorithm is agglomerative hierarchical clustering. Roughly, in each iteration, it merges the closest pair of clusters. It was rst proposed way back in 1951, and since then there have been numerous mod-iications. Some of its good features are: a natural, simple, and non-parametric grouping of similar objects which is capab...

A Recurrence Plot-Based Distance Measure

Given a set of time series, our goal is to identify prototypes that cover the maximum possible amount of occurring subsequences regardless of their order. This scenario appears in the context of the automotive industry, where the goal is to determine operational profiles that comprise frequently recurring driving behavior patterns. This problem can be solved by clustering, however, standard dis...

Using a Time-dependent Dalitz Plot Analysis

We report a measurement of CP-violating asymmetries in B 0 → (ρπ) 0 → π + π − π 0 decays using a time-dependent Dalitz plot analysis. The results are obtained from a data sample of 347 million Υ (4S) → BB decays, collected by the BABAR detector at the PEP-II asymmetric-energy B Factory at SLAC. We measure 26 coefficients of the bilinear form factor terms occurring in the time-dependent decay ra...

The Modulo Time Plot - A Useful Data Acquisition Diagnostic Tool

This paper illustrates the use of the Modulo Time Plot to facilitate diagnosis of data acquisition systems and components. While conventional techniques, involving spectral analysis and histograms, provide certain useful and necessary measures of performance, the use of reordered sample sets has gained considerable popularity in recent work aimed at characterizing analog-to-digital converter er...

Visualising space time patterns in crime: the hotspot plot